GATE CSE 2017 SET-2
Q11.
If a random variable X has a Poisson distribution with mean 5, then the expectation E[(X+2)^{2}] equals ______________.Q12.
Consider the following C program. #include < stdio.h > int main ( ) { int m = 10; int n, n1; n = ++m; n1 = m++; n--; --n1; n-=n1; printf ("%d", n) ; return 0; } The output of the program is ______________.Q13.
Let L_{1},L_{2} be any two context free languages and R be any regular language. Then which of the following is/are CORRECT ? I. L_{1}\cup L_{2} is context - free II. \bar{L_{1}} is context - free III. L_{1} - R is context - free IV. L_{1}\cap L_{2} is context - freeQ14.
Consider the following languages L_{1}=\{a^{p}|p is a prime number} L_{2}=\{a^{n}b^{m}c^{2m}|n\geq 0,m\geq 0\} L_{3}=\{a^{n}b^{n}c^{2n}|n\geq 0\} L_{4}=\{a^{n}b^{n}|n\geq 1\} Which of the following are CORRECT ? I.L_{1} is context-free but not regular. II. L_{2} is not context-free. III. L_{3} is not context-free but recursive. IV. L_{4} is deterministic context-free.Q15.
Consider the following expression grammar G: E\rightarrowE-T|T T\rightarrowT+F|F F\rightarrow(E)|id Which of the following grammars is not left recursive, but is equivalent to G?Q16.
Which of the following statements about parser is/are CORRECT? I. Canonical LR is more powerful than SLR. II. SLR is more powerful than LALR III. SLR is more powerful than Canonical LR.Q17.
Identify the language generated by the following grammar, where S is start variable. S\rightarrow XY X\rightarrow aX|a Y \rightarrowaYb|\inQ18.
Consider the set of processes with arrival time (in milliseconds). CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time. The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is __________Q19.
Consider a binary code that consists of only four valid code words as given below: 00000,01011,10101,11110 Let the minimum Hamming distance of the code be p and the maximum number of erroneous bits that can be corrected by the code be q. Then the values of p and q areQ20.
Consider two hosts X and Y, connected by a single direct link of rate 10^{6} bits/sec . The distance between the two hosts is 10,000 km and the propagation speed along the link is 2x10^{8} m/sec . Host X sends a file of 50,000 bytes as one large message to host Y continuously. Let the transmission and propagation delays be p milliseconds and q milliseconds, respectively . Then the values of p and q are